P-Partitions and Quasisymmetric Power Sums

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partially Ordinal Sums and P-partitions

We present a method of computing the generating function fP (x) of P -partitions of a poset P . The idea is to introduce two kinds of transformations on posets and compute fP (x) by recursively applying these transformations. As an application, we consider the partially ordinal sum Pn of n copies of a given poset, which generalizes both the direct sum and the ordinal sum. We show that the seque...

متن کامل

On P-partitions related to ordinal sums of posets

Using the inclusion–exclusion principle, we derive a formula of generating functions for P-partitions related to ordinal sums of posets. This formula simplifies computations for many variations of plane partitions, such as plane partition polygons and plane partitions with diagonals or double diagonals. We illustrate our method by several examples, some of which are new variations of plane part...

متن کامل

Partitions and Sums and Products of Integers

The principal result of the paper is that, if r < u and (A¡)i<r is a partition of u, then there exist i < r and infinite subsets B and C of to such that 2 F e A¡ and IIG G A¡ whenever F and G are finite nonempty subsets of B and C respectively. Conditions on the partition are obtained which are sufficient to guarantee that B and C can be chosen equal in the above statement, and some related fin...

متن کامل

Simultaneous Core Partitions: Parameterizations and Sums

Fix coprime s, t > 1. We re-prove, without Ehrhart reciprocity, a conjecture of Armstrong (recently verified by Johnson) that the finitely many simultaneous (s, t)cores have average size 1 24(s−1)(t−1)(s+t+1), and that the subset of self-conjugate cores has the same average (first shown by Chen–Huang–Wang). We similarly prove a recent conjecture of Fayers that the average weighted by an inverse...

متن کامل

Power Sum Expansion of Chromatic Quasisymmetric Functions

The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley’s chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2020

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnz375